System - Dependence - Graph - Based Slicing of Programs

Many algorithms for automating software engineering tasks require program slices. To be applicable to large software systems, these slices must be computed in-terprocedurally. Slicing techniques based on the system dependence graph (SDG) provide one approach for computing interprocedural slices, but these techniques are deened only for programs in which called procedures necessarily return to call sites. When applied to programs that contain arbitrary interprocedural control ow, existing SDG-based slicing techniques can compute incorrect slices; this limits their applicability. This paper presents an approach to constructing SDGs, and computing slices on SDGs, that accommodates programs with arbitrary interprocedural control ow. The main beneet of our approach is that it allows the use of the SDG-based slicing technique on a wide class of practical programs to which it did not previously apply.